An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations

Cuckoo hashing is a hash table data structure introduced in [1], that offers constant worst case search time. As a major contribution of this paper, we analyse modified versions of this algorithm with improved performance. Further, we provide an asymptotic analysis of the search costs of all this variants of cuckoo hashing and compare this results with the well known properties of double hashing and linear probing. The analysis is supported by numerical results. Finally, our analysis shows, that the expected number of steps of search operations can be reduced by using a modified version of cuckoo hashing instead of standard algorithms based on open addressing.